Degrees of Non-determinism and Concurrency: A Petri Net View
نویسندگان
چکیده
منابع مشابه
Concurrency-degrees for Petri Nets
The goal of this paper is to extend some concepts (about concurrencydegrees) from the class of Place/Transition Petri nets (PTN) to the class of jumping Petri nets (JPTN). Also, we will present a simpler definition of concurrency-degree for PTN. Moreover, we will point out how we can compute these concurrency-degrees.
متن کاملA Petri Net View of Mobility
Mobile systems explore the interplay between locality and connectivity. A subsystem may have a connection to a remote subsystem and use this for communication. Alternatively, it may be necessary or desirable to move the subsystem close to the other in order to communicate. This paper presents a Petri Net formalisation of mobile systems so as to harness the intuitive graphical representation of ...
متن کاملExtracting a Petri Net Representation of Java Concurrency: Literature Survey
Automated analysis is necessary to verify the correct operation of concurrent systems. Petri Nets have a large body of research, both theoretical and practical, supporting their use for concurrent system analysis. The Java language provides built-in capabilities for developing concurrent systems with threads. Researchers have examined how to extract Transition Systems from Java source and how t...
متن کاملExtracting a Petri Net Representation of Java Concurrency
Automated analysis is necessary to verify the correct operation of concurrent systems. Petri nets have a large body of research, both theoretical and practical, supporting their use for concurrent system analysis. The Java language provides built-in capabilities for developing concurrent systems with threads. Researchers have examined how to extract transition systems from Java source and how t...
متن کاملConcurrency for Graph Grammars in a Petri net shell
Graph grammars are a powerful model of concurrent and distributed systems which can be seen as a proper extension of Petri nets. Inspired by this correspondence we develop truly concurrent semantics for dpo graph grammars based on (deterministic) processes and on a Winskel’s style unfolding construction, and we show that the two approaches can be reconciled. A basic role is played by the study ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: DAIMI Report Series
سال: 1984
ISSN: 2245-9316,0105-8517
DOI: 10.7146/dpb.v13i180.7455